A Survey of Techniques for Fixed Radius near Neighbor Searching . . . 4 . . . 18
ثبت نشده
چکیده
I ARS'IRACT This paper is a survey of techniques used for searching in a multidimensicnal space. Though we ccnsider specifically the Froblem of searching for fixed radius near neighbors (that is, all points within a fixed distance of a given point), the structures presented bere are applicable to eiany different search problems in multidimensional spaces. The orientation of this paper is practical; nc theoretical results are presented. ?Iany areas open for further research are mentioned. KEY WORDS AND KEY FBRASES associative searching k-a trees fixed radius near neighbcr searching nearest neighbor searching 1.
منابع مشابه
An Improved Algorithm for the Fixed-Radius Neighbor Problem
The planar fixed-radius near neighbor problem can be stated as follows: Preprocess a set P of N points in the plane so that all points of P lying within some fixed radius r of a new point can be listed effectively. This problem has many practical applications in domains as varied as molecular graphics, statistics, air traffic control or data transmission [3]. Although a great deal of work has b...
متن کاملSurvey of Hashing Techniques for Compact Bit Representations of Images
Binary encoding schemes that preserve similarity in large collections of images are required for faster retrieval and effective storage. There have been many recent hashing techniques that produce semantic binary representations. This paper presents a survey of such hashing techniques that allows faster nearest neighbor search in hamming space. Specifically, approaches that use locality-sensiti...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملSequential and Mapreduce-based Algorithms for Constructing an In-place Multidimensional Quad-tree Index for Answering Fixed-radius Nearest Neighbor Queries
Answering fixed-radius nearest neighbor queries constitutes an important problem in many areas, ranging from geographic systems to similarity searching in object databases (e.g. image and video databases). The usual approach in order to efficiently answer such queries is to construct an index. In this paper we present algorithms for constructing a multidimensional quad-tree index. We start with...
متن کاملGreedy Randomized Adaptive Search Procedure for Traveling Salesman Problem
Greedy Randomized Adaptive Search Procedure for Traveling Salesman Problem. (May 2005) Seung Ho Lee, B.E., Korea University Chair of Advisory Committee: Dr. Sergiy Butenko In this thesis we use greedy randomize adaptive search procedure (GRASP) to solve the traveling salesman problem (TSP). Starting with nearest neighbor method to construct the initial TSP tour, we apply the 2-opt and the path-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1975